Enhancement of Quantum Secret Sharing Using Exclusive-OR and Shift Operation

نویسندگان

  • Kondwani Makanda
  • Jun-Cheol Jeon
چکیده

We propose quantum secret sharing scheme that emphasizes on the cooperation (twice) of communicating parties to avoid untrustworthy members and improves the strength of the key. The proposed scheme is a new approach in quantum secret sharing in which cooperation of the parties is emphasized at the same time the key is strengthened by performing a shift operation on the received partial keys. In this method, we have managed to achieve the following: security of the key is significantly enhanced; cooperation between parties is also increased (to two) and improved. This method shows that it is difficult for an eavesdropper to obtain the key easily. It is also hard for the communicating parties to cheat since key verification is done twice and if any member cheats, it can easily be identified and communication can be aborted immediately.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptable (n, n) Secret Image Sharing Mechanism Based on Boolean Operation

Secret image sharing, as an extension of secret sharing, has attracted the attention of many scholars in recent years. Multi-secret image sharing is an extension of traditional secret image sharing in which only one secret image can be shared among one group. In order to extend the utility of the mechanism, we propose an innovative (n, n) secret image sharing scheme based on matrix transformati...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

On the design and security of a lattice-based threshold secret sharing scheme

In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

Robust Steganography Using LSB-XOR and Image Sharing

Hiding and securing the secret digital information and data that are transmitted over the internet is of widespread and most challenging interest. This paper presents a new idea of robust steganography using bitwise-XOR operation between stego-key-image-pixel LSB (Least Significant Bit) value and secret messagecharacter ASCII-binary value (or, secret imagepixel value). The stego-key-image is sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015